A note on list-processing in BCL
نویسندگان
چکیده
منابع مشابه
A note on partial list coloring
Let G be a simple graph with n vertices and list chromatic number χl(G) = χl. Suppose that 0 ≤ t ≤ χl and each vertex of G is assigned a list of t colors. Albertson, Grossman and Haas [1] conjectured that at least tn χl vertices of G can be colored from these lists. In this paper we find some new results in partial list coloring which help us to show that the conjecture is true for at least hal...
متن کاملA Note on a List Colouring of Hypergraphs
In the note we present two results. The first of them gives a sufficient condition for a colouring of a hypergraph from an assigned list. It generalises the analogous fact for graphs. The second result states that for every k ≥ 3 and every l ≥ 2, a distance between the list chromatic number and the chromatic number can be arbitrarily large in the class of k−uniform hypergraphs with the chromati...
متن کاملA Note on Graph Coloring Extensions and List-Colorings
Let G be a graph with maximum degree ∆ ≥ 3 not equal to K∆+1 and let P be a subset of vertices with pairwise distance, d(P ), between them at least 8. Let each vertex x be assigned a list of colors of size ∆ if x ∈ V \P and 1 if x ∈ P . We prove that it is possible to color V (G) such that adjacent vertices receive different colors and each vertex has a color from its list. We show that d(P ) c...
متن کاملA note on list improper coloring of plane graphs
A list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex v for every v ∈ V (G). An (L, d)-coloring is a mapping φ that assigns a color φ(v) ∈ L(v) to each vertex v ∈ V (G) such that at most d neighbors of v receive color φ(v). A graph is called (k, d)-choosable, if G admits an (L, d)-coloring for every list assignment L with |L(v)| ≥ k for all v ∈ V (G). In th...
متن کاملA Software Architecture for Parallel List Processing on Grids
The Data List Management Library (DLML) processes data lists in parallel, balancing the workload transparently to programmers. Programmers only need to organise data into a list, use DLML functions to insert and get data items, and specify the sequential function(s) to process each data item according to the application logic. The first design of DLML was targeted for use at a single cluster. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1969
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/12.4.332